#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1010;

LL n, m, q;
LL f[N][N];

void add(int x1, int y1, int x2, int y2, int x)
{
    f[x1][y1] += x, f[x1][y2 + 1] -= x;
    f[x2 + 1][y1] -= x, f[x2 + 1][y2 + 1] += x;
}

int main()
{
    cin >> n >> m >> q;
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= m;j ++)
        {
            int x; cin >> x;
            add(i, j, i, j, x);
        }
    }
    while(q --)
    {
        int x1, y1, x2, y2, k; cin >> x1 >> y1 >> x2 >> y2 >> k;
        add(x1, y1, x2, y2, k);
    }
    for(int i = 1;i <= n;i ++)
    {
        for(int j = 1;j <= m;j ++)
        {
            f[i][j] += f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1];
            cout << f[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}